Boole's and other proofs of Fourier's Double-Integral Theorem
نویسندگان
چکیده
منابع مشابه
Hybrid Proofs of the q-Binomial Theorem and Other Identities
We give “hybrid” proofs of the q-binomial theorem and other identities. The proofs are “hybrid” in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the Identity Theorem) to prove the full version. We prove three somewhat unusual summation formulae, and use these to give hybrid proofs of a number of identities d...
متن کاملexistence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولSeveral Proofs of Ihara's Theorem
We give three proofs that the reciprocal of Ihara's zeta function can be expressed as a simple polynomial times a determinant involving the adjacency matrix of the graph. The rst proof, for regular graphs, is based on representing radial symmetric eigenfunctions on regular trees in terms of certain polynomials. The second proof, also for regular graphs, is a consequence of the fact that the res...
متن کاملTwo Proofs of Ihara's Theorem
We give two proofs that, for a nite regular graph, the reciprocal of Ihara's zeta function can be expressed as a simple polynomial times a determinant involving the adjacency matrix of the graph. The rst proof is based on representing radial symmetric eigenfunctions on regular trees in terms of certain polynomials. The second proof is a consequence of the fact that the resolvent of the adjacenc...
متن کاملEuclidean Proofs of Dirichlet’s Theorem
Euclid’s proof of the infinitude of the primes is a paragon of simplicity: given a finite list of primes, multiply them together and add one. The resulting number, say N , is not divisible by any prime on the list, so any prime factor of N is a new prime. Some special cases of Dirichlet’s theorem admit a simple proof following Euclid’s model, such as the case of 1 mod 4 or 5 mod 6. (We mean by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 1884
ISSN: 0013-0915,1464-3839
DOI: 10.1017/s0013091500037275